A distributed continuous-time modified Newton–Raphson algorithm

We propose a continuous-time second-order optimization algorithm for solving unconstrained convex problems with bounded Hessian. show that this alternative has comparable convergence rate to of the Newton–Raphson method, however structurally, it is amenable more efficient distributed implementation. present implementation our proposed and prove its via Lyapunov analysis. A numerical example demonstrates results.